A Set-Theoretical Definition of Application
نویسنده
چکیده
منابع مشابه
A modification of probabilistic hesitant fuzzy sets and its application to multiple criteria decision making
Probabilistic hesitant fuzzy set (PHFS) is a fruitful concept that adds to hesitant fuzzy set (HFS) the term of probability which is able to retain more information than the usual HFS. Here, we demonstrate that the existing definitions of PHFS are not still reasonable, and therefore, we first improve the PHFS definition. By endowing the set and algebraic operations with a new re-definition of P...
متن کاملGeometry Definition and Contact Analysis of Spherical Involute Straight Bevel Gears
A practical application of the spherical involute surface to the forged straight bevel gears is provided and demonstrated in this work. Conjugate (pure involute) theoretical surfaces are developed from the input design parameters. The surfaces are modified to suit the actual application (automotive differential). The unloaded (or low load) tooth contact analysis of modified surfaces is performe...
متن کاملOn generalized fuzzy numbers
This paper first improves Chen and Hsieh’s definition of generalized fuzzy numbers, which makes it the generalization of definition of fuzzy numbers. Secondly, in terms of the generalized fuzzy numbers set, we introduce two different kinds of orders and arithmetic operations and metrics based on the λ-cutting sets or generalized λ-cutting sets, so that the generalized fuzzy numbers are integrat...
متن کاملA duality between fuzzy domains and strongly completely distributive $L$-ordered sets
The aim of this paper is to establish a fuzzy version of the dualitybetween domains and completely distributive lattices. All values aretaken in a fixed frame $L$. A definition of (strongly) completelydistributive $L$-ordered sets is introduced. The main result inthis paper is that the category of fuzzy domains is dually equivalentto the category of strongly completely distributive $L$-ordereds...
متن کاملDiscovering Classification Rules Using variable-Valued Logic System VL1
The paper presents a set-theoretical definition of the classification problem, and then discusses and illustrates by examples the application of the variable-valued logic system VL. to the synthesis of minimal (or simplest) classification rules under cost (or simplicity) functionals designed by a user from available criteria.
متن کامل